On restricted edge-colorings of bicliques
نویسندگان
چکیده
We investigate the minimum and maximum number of colors in edge-colorings of Kn,n such that every copy of Kp,p receives at least q and at most q′ colors. Along the way we improve the bounds on some bipartite Turán numbers.
منابع مشابه
Graphs and colors : edge-colored graphs, edge-colorings and proper connections. (Graphes et couleurs : graphes arêtes-coloriés, coloration d'arêtes et connexité propre)
In this thesis, we study different problems in edge-colored graphs and edge-colored multigraphs, such as proper connection, strong edge colorings, and proper hamiltonian paths and cycles. Finally, we improve the known O(n) algorithm to decide the behavior of a graph under the biclique operator, by studying bicliques in graphs without false-twin vertices. In particular, • We first study the k-pr...
متن کاملBounds on Edge Colorings with Restrictions on the Union of Color Classes
We consider constrained proper edge colorings of the following type: Given a positive integer j and a family F of connected graphs on 3 or more vertices, we require that the subgraph formed by the union of any j color classes has no copy of any member of F . This generalizes some well-known types of colorings such as acyclic edge colorings, distance-2 edge colorings, low treewidth edge coloring...
متن کاملUniquely Restricted Matchings and Edge Colorings
A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. This notion was defined by Golumbic, Hirst, and Lewenstein and studied in a number of articles. Our contribution is twofold. We provide approximation algorithms for computing a uniquely restricted matching of maximum size in some bipartite graphs. In particular, we achieve a ratio of 9/5 f...
متن کاملOn edge-sets of bicliques in graphs
A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the associated edge-biclique hypergraph whose hyperedges are precisely the edge-sets of all bicliques. We characterize graphs whose edgebiclique hypergraph is conformal (i.e., it is the clique hypergraph of its 2-section) ...
متن کاملIncremental Maintenance of Maximal Bicliques in a Dynamic Bipartite Graph
We consider incremental maintenance of maximal bicliques from a dynamic bipartite graph that changes over time due to the addition of edges. When new edges are added to the graph, we seek to enumerate the change in the set of maximal bicliques, without enumerating the set of maximal bicliques that remain unaffected. The challenge in an efficient algorithm is to enumerate the change without expl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 257 شماره
صفحات -
تاریخ انتشار 2002